Diagnosis using a first-order stochastic language that learns

نویسندگان

  • Chayan Chakrabarti
  • Roshan Rammohan
  • George F. Luger
چکیده

!iagn&sis; )sing a *irst-.r/er 1t&c3astic; 4ang5age 63at 4earns 73a8an 73a9ra:arti; <&s3an; e&rge; *. 45ger Department of Computer Science University of New Mexico Albuquerque, NM 87131 {cc, roshan, luger} @cs.unm.edu

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Design and Testing of a First-order Logic-based Stochastic Modeling Language

We have created a logic-based Turing-complete language for stochastic modeling. Since the inference scheme for this language is based on a variant of Pearl’s loopy belief propagation algorithm, we call it Loopy Logic. Traditional Bayesian Networks have limited expressive power, basically constrained to finite domains as in the propositional calculus. This language contains variables that can ca...

متن کامل

A First-Order Stochastic Prognostic System for the Diagnosis of Helicopter Rotor Systems for the US Navy

C We have created a diagnostic system for the US Navy to use in the analysis of the “running health” of helicopter rotor systems. Although our system is not yet deployed for real-time in-flight diagnosis, we have successfully analyzed the data sets of actual helicopter rotor failures supplied by the US Navy. We discuss both critical techniques supporting the design of our stochastic diagnostic ...

متن کامل

A First-Order Stochastic Modeling Language for Diagnosis

We have created a logic-based, first-order, and Turingcomplete set of software tools for stochastic modeling. Because the inference scheme for this language is based on a variant of Pearl's loopy belief propagation algorithm, we call it Loopy Logic. Traditional Bayesian belief networks have limited expressive power, basically constrained to that of atomic elements as in the propositional calcul...

متن کامل

Stochastic bounds for a single server queue with general retrial times

We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds‎. ‎The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques‎.

متن کامل

PU-learning disjunctive concepts in ILP

PU learning is a variant of semi-supervised learning where labels of only one class are given. In his paper, we present an ILP method that PU-learns disjunctive concepts. The problem is motivated by some work on natural language learning, more specifically, learning the meaning of n-grams from (sentence, context)-pairs, where the context is described using first-order logic. An earlier solution...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Expert Syst. Appl.

دوره 32  شماره 

صفحات  -

تاریخ انتشار 2007